Relating Rewriting Techniques on Monoids and Rings: Congruences on Monoids and Ideals in Monoid Rings

نویسندگان

  • Klaus Madlener
  • Birgit Reinert
چکیده

A rst explicit connection between nitely presented commutative monoids and ideals in polynomial rings was used 1958 by Emelichev yielding a solution to the word problem in commutative monoids by deciding the ideal membership problem. The aim of this paper is to show in a similar fashion how congruences on monoids and groups can be characterized by ideals in respective monoid and group rings. These characterizations enable to transfer well known results from the theory of string rewriting systems for presenting monoids and groups to the algebraic setting of subalgebras and ideals in monoid respectively group rings. Moreover, natural one-sided congruences deened by subgroups of a group are connected to one-sided ideals in the respective group ring and hence the subgroup problem and the ideal membership problem are directly related. For several classes of nitely presented groups we show explicitly how Grr obner basis methods are related to existing solutions of the subgroup problem by rewriting methods. For the case of general monoids and submonoids weaker results are presented. In fact it becomes clear that string rewriting methods for monoids and groups can be lifted in a natural fashion to deene reduction relations in monoid and group rings.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

String Rewriting and Grr Obner Bases { a General Approach to Monoid and Group Rings Presented at the Workshop on Symbolic Rewriting Systems

The concept of algebraic simpliication is of great importance for the eld of symbolic computation in computer algebra. In this paper we review some fundamental concepts concerning reduction rings in the spirit of Buchberger. The most important properties of reduction rings are presented. The techniques for presenting monoids or groups by string rewriting systems are used to deene several types ...

متن کامل

On zero divisor graph of unique product monoid rings over Noetherian reversible ring

 Let $R$ be an associative ring with identity and $Z^*(R)$ be its set of non-zero zero divisors.  The zero-divisor graph of $R$, denoted by $Gamma(R)$, is the graph whose vertices are the non-zero  zero-divisors of  $R$, and two distinct vertices $r$ and $s$ are adjacent if and only if $rs=0$ or $sr=0$.  In this paper, we bring some results about undirected zero-divisor graph of a monoid ring o...

متن کامل

Divisorial rings and Cox rings

1 Preliminaries on monoids Definition 1.1. An Abelian monoid is a set with a binary, associative, and commutative operation which has a neutral element. It will often be called just a monoid in this manuscript because we will not deal with non-commutative monoids. A monoid M is called • finitely generated if there is a finite set of generators, or equivalently if there is a surjection of monoid...

متن کامل

The isomorphism problem for monoid rings of rank 2 monoids *

The main result of this paper is that for a commutative ring R and finitely generated submonoids M and N of Z2 the monoid rings R [M] and R[N] are isomorphic as R algebras if and only if M and N are isomorphic. In the course of proof we derive various results concerning the structure of rank 2 monoids and isomorphisms between the corresponding monoid rings. 1991 Math. Subj. Class.: 13B25, 20M25...

متن کامل

Finitely generated antisymmetric graph monoids

A graph monoid is a commutative monoid for which there is a particularly simple presentation, given in terms of a quiver. Such monoids are known to satisfy various nonstable K-theoretical representability properties for either von Neumann regular rings or C*-algebras. We give a characterization of graph monoids within finitely generated antisymmetric refinement monoids. This characterization is...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • Theor. Comput. Sci.

دوره 208  شماره 

صفحات  -

تاریخ انتشار 1998